A Tandem Queue Model for Two-Server Resequencing System∗
نویسندگان
چکیده
A two-server resequencing system has two heterogeneous servers and two buffers. One is an arrival buffer, which holds incoming jobs waiting for service. The other is a resequencing buffer, which resequences served jobs back to their arrival orders before departure. Such a system can be modeled as a two-stage tandem queue where the jobs are always kept in the arrival orders but the servers swap the positions upon any job departure. With the assumption of phase-type distributions for job interarrival and service time, the Markovian properties of the state transition is preserved in the model. The stationary probability distribution and the stationary conditions are obtained by the matrix-geometric solution approach. The performance is evaluated in five numerical experiments. The main conclusions are: a small resequencing buffer reduces the mean delay of the jobs significantly; the burstness of arrival traffic has positive influence on the mean delay; a heterogeneous system with more-balanced servers achieves better performance; and the slow server in a less-balanced system has negative effect which might eventually “starve” the fast server under heavy traffic load.
منابع مشابه
Queue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کاملOn Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer
In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...
متن کاملFINITE POPULATION SINGLE SERVER BATCH SERVICE QUEUE WITH COMPULSORY SERVER VACATION
A single server finite population queueing model with compulsory server vacation and with fixed batch service has been considered. For this model the system steady state probabilities are obtained. Some performance measures are calculated and numerical examples are also given.
متن کاملFinite Capacity Queuing System with Vacations and Server Breakdowns
This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...
متن کاملUnreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service
This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001